prime modulus

См. также в других словарях:

• Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

• Modulus — Guitars es una firma estadounidense dedicada a la construcción de bajos y guitarras eléctricas, pionera en el uso del grafito en la construcción de los mástiles de sus instrumentos. Contenido 1 Historia 2 Modelos de bajo eléctrico 3 Véase también …   Wikipedia Español

• Modulus (algebraic number theory) — In mathematics, in the field of algebraic number theory, a modulus (plural moduli) (or cycle,[1] or extended ideal[2]) is a formal product of places of a global field (i.e. an algebraic number field or a global function field). It is used to… …   Wikipedia

• Strong prime — In mathematics, a strong prime is a prime number with certain special properties. The definitions of strong primes are different in cryptography and number theory. Definition in cryptography In cryptography, a prime number p is strong if the… …   Wikipedia

• Safe prime — A safe prime is a prime number of the form 2 p + 1, where p is also a prime. (Conversely, the prime p is a Sophie Germain prime.) The first few safe primes are5, 7, 11, 23, 47, 59, 83, 107, 167, 179, 227, 263, 347, 359, 383, 467, 479, 503, 563,… …   Wikipedia

• Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …   Wikipedia

• Index calculus algorithm — In group theory, the index calculus algorithm is an algorithm for computing discrete logarithms. This is the best known algorithm for certain groups, such as mathbb{Z} m^* (the multiplicative group modulo m ).Dubious|date=April 2008 Description… …   Wikipedia

• Key size — In cryptography, key size or key length is the size measured in bits[1] of the key used in a cryptographic algorithm (such as a cipher). An algorithm s key length is distinct from its cryptographic security, which is a logarithmic measure of the… …   Wikipedia

• Naccache-Stern knapsack cryptosystem — Note: this is not to be confused with the Naccache Stern cryptosystem based on the higher residuosity problem.The Naccache Stern Knapsack Cryptosystem is an atypical Public Key Cryptosystem developed by David Naccache and Jacques Stern in 1997.… …   Wikipedia

• Naccache–Stern knapsack cryptosystem — Note: this is not to be confused with the Naccache–Stern cryptosystem based on the higher residuosity problem. The Naccache–Stern Knapsack Cryptosystem is an atypical public key cryptosystem developed by David Naccache and Jacques Stern in 1997.… …   Wikipedia

• Partition (number theory) — Young diagrams associated to the partitions of the positive integers 1 through 8. They are so arranged that images under the reflection about the main diagonal of the square are conjugate partitions. In number theory and combinatorics, a… …   Wikipedia